Random Generation of Nondeterministic Finite-State Tree Automata
نویسندگان
چکیده
منابع مشابه
Random Generation of Nondeterministic Finite-State Tree Automata
Algorithms for (nondeterministic) finite-state tree automata (FTAs) are often tested on random FTAs, in which all internal transitions are equiprobable. The run-time results obtained in this manner are usually overly optimistic as most such generated random FTAs are trivial in the sense that the number of states of an equivalent minimal deterministic FTA is extremely small. It is demonstrated t...
متن کاملRandom Generation of Nondeterministic Tree Automata
Algorithms for (nondeterministic) finite-state tree automata (NTA) are often tested on random NTA, in which all internal transitions are equiprobable. The run-time results obtained in this manner are usually overly optimistic as most such generated random NTA are trivial in the sense that the number of states of an equivalent minimal deterministic finite-state tree automaton is extremely small....
متن کاملNondeterministic Finite Automata
This is an example of what is called a nondeterministic finite automaton (NFA). Intuitvely, such a machine could have many possible computations on a given input. For example, on an input of the form u001v, it is possible for the machine to reach the accepting state qp by transitioning from q to q0 after reading u. Similarly, it is possible for the machine to reach qp also on the input u01v — f...
متن کاملReduction of Nondeterministic Tree Automata
We present an efficient algorithm to reduce the size of nondeterministic tree automata, while retaining their language. It is based on new transition pruning techniques, and quotienting of the state space w.r.t. suitable equivalences. It uses criteria based on combinations of downward and upward simulation preorder on trees, and the more general downward and upward language inclusions. Since tr...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.134.2